全文获取类型
收费全文 | 11560篇 |
免费 | 788篇 |
国内免费 | 274篇 |
专业分类
化学 | 307篇 |
晶体学 | 1篇 |
力学 | 667篇 |
综合类 | 115篇 |
数学 | 10214篇 |
物理学 | 1318篇 |
出版年
2023年 | 64篇 |
2022年 | 92篇 |
2021年 | 176篇 |
2020年 | 218篇 |
2019年 | 204篇 |
2018年 | 222篇 |
2017年 | 260篇 |
2016年 | 271篇 |
2015年 | 187篇 |
2014年 | 481篇 |
2013年 | 836篇 |
2012年 | 604篇 |
2011年 | 484篇 |
2010年 | 502篇 |
2009年 | 646篇 |
2008年 | 651篇 |
2007年 | 714篇 |
2006年 | 532篇 |
2005年 | 496篇 |
2004年 | 373篇 |
2003年 | 373篇 |
2002年 | 370篇 |
2001年 | 354篇 |
2000年 | 370篇 |
1999年 | 282篇 |
1998年 | 260篇 |
1997年 | 235篇 |
1996年 | 235篇 |
1995年 | 231篇 |
1994年 | 176篇 |
1993年 | 171篇 |
1992年 | 170篇 |
1991年 | 151篇 |
1990年 | 130篇 |
1989年 | 95篇 |
1988年 | 112篇 |
1987年 | 76篇 |
1986年 | 104篇 |
1985年 | 147篇 |
1984年 | 104篇 |
1983年 | 34篇 |
1982年 | 66篇 |
1981年 | 52篇 |
1980年 | 45篇 |
1979年 | 41篇 |
1978年 | 58篇 |
1977年 | 64篇 |
1976年 | 36篇 |
1975年 | 14篇 |
1974年 | 17篇 |
排序方式: 共有10000条查询结果,搜索用时 234 毫秒
41.
We introduce here some Itô calculus for non-continuous Dirichlet processes. Such calculus extends what was known for continuous Dirichlet processes or for semimartingales. In particular we prove that non-continuous Dirichlet processes are stable under C
1 transformation. 相似文献
42.
43.
The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study 总被引:1,自引:0,他引:1
Bram Verweij Shabbir Ahmed Anton J. Kleywegt George Nemhauser Alexander Shapiro 《Computational Optimization and Applications》2003,24(2-3):289-333
The sample average approximation (SAA) method is an approach for solving stochastic optimization problems by using Monte Carlo simulation. In this technique the expected objective function of the stochastic problem is approximated by a sample average estimate derived from a random sample. The resulting sample average approximating problem is then solved by deterministic optimization techniques. The process is repeated with different samples to obtain candidate solutions along with statistical estimates of their optimality gaps.We present a detailed computational study of the application of the SAA method to solve three classes of stochastic routing problems. These stochastic problems involve an extremely large number of scenarios and first-stage integer variables. For each of the three problem classes, we use decomposition and branch-and-cut to solve the approximating problem within the SAA scheme. Our computational results indicate that the proposed method is successful in solving problems with up to 21694 scenarios to within an estimated 1.0% of optimality. Furthermore, a surprising observation is that the number of optimality cuts required to solve the approximating problem to optimality does not significantly increase with the size of the sample. Therefore, the observed computation times needed to find optimal solutions to the approximating problems grow only linearly with the sample size. As a result, we are able to find provably near-optimal solutions to these difficult stochastic programs using only a moderate amount of computation time. 相似文献
44.
G. Z. Ruan S. Y. Wang Y. Yamamoto S. S. Zhu 《Journal of Optimization Theory and Applications》2004,123(2):409-429
In this paper, a model of a linear multilevel programming problem with dominated objective functions (LMPPD(l)) is proposed, where multiple reactions of the lower levels do not lead to any uncertainty in the upper-level decision making. Under the assumption that the constrained set is nonempty and bounded, a necessary optimality condition is obtained. Two types of geometric properties of the solution sets are studied. It is demonstrated that the feasible set of LMPPD(l) is neither necessarily composed of faces of the constrained set nor necessarily connected. These properties are different from the existing theoretical results for linear multilevel programming problems. 相似文献
45.
A server needs to compute a broadcast schedule for n pages whose request times are known in advance. Outputting a page satisfies all outstanding requests for the page. The goal is to minimize the average waiting time of a client. In this paper, we show the equivalence of two apparently different relaxations that have been considered for this problem. 相似文献
46.
Robust linear optimization under general norms 总被引:1,自引:0,他引:1
We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients. 相似文献
47.
The control of piecewise-deterministic processes is studied where only local boundedness of the data is assumed. Moreover the discount rate may be zero. The value function is shown to be solution to the Bellman equation in a weak sense; however the solution concept is strong enough to generate optimal policies. Continuity and compactness conditions are given for the existence of nonrelaxed optimal feedback controls. 相似文献
48.
K. Kubilius 《Acta Appl Math》2003,78(1-3):233-242
We consider the integral equation driven by a standard Brownian motion and by a fractional Brownian motion. Sufficient conditions under which the equation has a weak solution are obtained. 相似文献
49.
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically. 相似文献
50.